منابع مشابه
Distributed Typed Concurrent Objects: a Programming Language for Distributed Computations with Mobile Resources
We describe a programming language for distributed computations that supports mobile resources and is based on a process calculus. The syntax, semantics and implementation of the language are presented with a focus on the novel model of computation.
متن کاملPtolemy: A Language with Quantified, Typed Events
Implicit invocation (II) and aspect-oriented (AO) languages provide related but distinct mechanisms for separation of concerns. II languages have explicitly announced events that run registered observer methods. AO languages have implicitly announced events that run method-like but more powerful advice. A limitation of II languages is their inability to refer to a large set of events succinctly...
متن کاملPān̄ini: A Language with Asynchronous, Typed Events
Writing programs using explicit concurrency constructs such as threads is hard and error prone. To solve this problem many recent language design efforts have focused on features that manage the details of concurrency behind the scene, while exposing easy to use and checked programming discipline to the programmers. The subject of this work, the Pān̄ini language, has similar goals. To that end, ...
متن کاملDesign, Semantics and Implementation of the Ptolemy Programming Language: A Language with Quantified Typed Events
Implicit invocation (II) and aspect-oriented (AO) languages provide software designers with related but distinct mechanisms and strategies for decomposing programs into modules and composing modules into systems. II languages have explicitly announced events that run registered observer methods. AO languages have implicitly announced events that run method-like but more powerful advice. A limit...
متن کاملTyped Concurrent Programming with Logic Variables
We present a concurrent higher-order programming language called Plain and a concomitant static type system. Plain is based on logic variables and computes with possibly partial data structures. The data structures of Plain are procedures, cells, and records. Plain’s type system features record-based subtyping, bounded existential polymorphism, and access modalities distinguishing between readi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Software
سال: 2004
ISSN: 0740-7459
DOI: 10.1109/ms.2004.1270763